Sorting array of 1000 distinct integers in the range [1, 5000], accessing each element at most once
Posted
by
Cronydevil
on Stack Overflow
See other posts from Stack Overflow
or by Cronydevil
Published on 2010-12-25T11:28:48Z
Indexed on
2010/12/26
5:54 UTC
Read the original article
Hit count: 181
Suppose you have an array of 1000 integers. The integers are in random order, but you know each of the integers is between 1 and 5000 (inclusive). In addition, each number appears only once in the array. Assume that you can access each element of the array only once. Describe an algorithm to sort it.
How i can sorting?
If you used auxiliary storage in your algorithm, can you find an algorithm that remains O(n) space complexity?
© Stack Overflow or respective owner